________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 21:45:18
Input Data from:  dataset162.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1645
Average f[i]   :4675
Average g[i,j] :2072,22222222222
Total demand   :16110
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 55
> Selected Move:	5670	1	-1	4	5500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 5670


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 69
> Selected Move:	7840	1	-1	6	12000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 7840


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 69
> Selected Move:	9590	1	-1	2	17000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 9590


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 92
> Selected Move:	10380	1	-1	9	21500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0    >new incumb.: 10380


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 102
> Selected Move:	10440	3	6	17	21000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0    >new incumb.: 10440


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 62
> Selected Move:	10740	1	-1	19	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1    >new incumb.: 10740


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 96
> Selected Move:	10740	3	4	3	24500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 93
> Selected Move:	10970	3	19	12	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0    >new incumb.: 10970


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 69
> Selected Move:	11170	3	9	13	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0    >new incumb.: 11170


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 53
> Selected Move:	11170	3	13	15	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 49
> Selected Move:	10930	3	15	14	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 49
> Selected Move:	10935	3	14	18	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 71
> Selected Move:	10805	3	12	19	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 65
> Selected Move:	10855	3	17	6	26000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 82
> Selected Move:	10760	3	18	13	25000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 79
> Selected Move:	10760	3	13	15	25000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 78
> Selected Move:	10745	3	19	12	25500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 17 #######################


> Neighbours evaluated; 84
> Selected Move:	10810	3	6	11	24500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 18 #######################


> Neighbours evaluated; 81
> Selected Move:	10810	3	3	4	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 19 #######################


> Neighbours evaluated; 84
> Selected Move:	10810	3	15	13	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 20 #######################


> Neighbours evaluated; 79
> Selected Move:	10810	3	4	3	24500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 21 #######################


> Neighbours evaluated; 93
> Selected Move:	10810	3	13	14	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 22 #######################


> Neighbours evaluated; 83
> Selected Move:	10780	3	14	8	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 23 #######################


> Neighbours evaluated; 61
> Selected Move:	10743	3	8	18	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 24 #######################


> Neighbours evaluated; 79
> Selected Move:	10690	3	18	9	24500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 25 #######################


> Neighbours evaluated; 92
> Selected Move:	10660	3	9	19	24000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 26 #######################


> Neighbours evaluated; 107
> Selected Move:	10670	3	11	17	24500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 27 #######################


> Neighbours evaluated; 107
> Selected Move:	10720	3	2	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 28 #######################


> Neighbours evaluated; 84
> Selected Move:	10680	3	18	8	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 29 #######################


> Neighbours evaluated; 89
> Selected Move:	10690	3	12	9	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 30 #######################


> Neighbours evaluated; 83
> Selected Move:	10710	3	19	7	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 31 #######################


> Neighbours evaluated; 69
> Selected Move:	10853	3	17	11	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 32 #######################


> Neighbours evaluated; 81
> Selected Move:	10775	3	11	18	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 33 #######################


> Neighbours evaluated; 72
> Selected Move:	10778	3	9	12	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 34 #######################


> Neighbours evaluated; 69
> Selected Move:	10730	3	12	19	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 35 #######################


> Neighbours evaluated; 59
> Selected Move:	10678	3	7	6	26500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 36 #######################


> Neighbours evaluated; 65
> Selected Move:	10690	4	1	3	23800


> New Y[]: 
	
	 2  0  0  3  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 37 #######################


> Neighbours evaluated; 32
> Selected Move:	11198	3	0	15	25400


> New Y[]: 
	
	 0  0  0  3  0  0  1  0  1  0  0  0  0  0  0  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 38 #######################


> Neighbours evaluated; 16
> Selected Move:	11360	4	3	6	23700


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  1  0  0  0  0  0  0  2  0  0  1  1    >new incumb.: 11360


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 39 #######################


> Neighbours evaluated; 25
> Selected Move:	11360	4	6	8	24800


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  3  0  0  0  0  0  0  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 40 #######################


> Neighbours evaluated; 17
> Selected Move:	11360	4	8	15	24400


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  2  0  0  0  0  0  0  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 41 #######################


> Neighbours evaluated; 22
> Selected Move:	11360	4	8	6	23400


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  1  0  0  0  0  0  0  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 42 #######################


> Neighbours evaluated; 23
> Selected Move:	11360	4	6	18	24900


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  3  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 43 #######################


> Neighbours evaluated; 15
> Selected Move:	11360	4	15	3	24800


> New Y[]: 
	
	 0  0  0  3  0  0  1  0  1  0  0  0  0  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 44 #######################


> Neighbours evaluated; 19
> Selected Move:	11360	4	3	6	23100


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  1  0  0  0  0  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 45 #######################


> Neighbours evaluated; 24
> Selected Move:	11360	4	6	8	24200


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  3  0  0  0  0  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 46 #######################


> Neighbours evaluated; 21
> Selected Move:	11360	4	8	18	24000


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  2  0  0  0  0  0  0  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 47 #######################


> Neighbours evaluated; 22
> Selected Move:	11360	4	8	6	23000


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  1  0  0  0  0  0  0  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 48 #######################


> Neighbours evaluated; 24
> Selected Move:	11360	4	18	3	23300


> New Y[]: 
	
	 0  0  0  3  0  0  2  0  1  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 49 #######################


> Neighbours evaluated; 22
> Selected Move:	11360	4	3	6	23900


> New Y[]: 
	
	 0  0  0  2  0  0  3  0  1  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 50 #######################


> Neighbours evaluated; 22
> Selected Move:	11360	4	3	8	22600


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  2  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 51 #######################


> Neighbours evaluated; 25
> Selected Move:	11360	4	6	3	24300


> New Y[]: 
	
	 0  0  0  3  0  0  1  0  2  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 52 #######################


> Neighbours evaluated; 19
> Selected Move:	11360	4	3	8	25000


> New Y[]: 
	
	 0  0  0  2  0  0  1  0  3  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 53 #######################


> Neighbours evaluated; 16
> Selected Move:	11360	4	3	6	22700


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  3  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 54 #######################


> Neighbours evaluated; 23
> Selected Move:	11360	4	8	19	24400


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  1  0  0  0  0  0  0  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 55 #######################


> Neighbours evaluated; 21
> Selected Move:	11360	4	6	19	24900


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  1  0  0  0  0  0  0  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 56 #######################


> Neighbours evaluated; 25
> Selected Move:	11270	3	15	13	24900


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  1  0  0  0  0  1  0  0  0  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 57 #######################


> Neighbours evaluated; 19
> Selected Move:	11270	4	6	19	24400


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  1  0  0  0  0  1  0  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 58 #######################


> Neighbours evaluated; 19
> Selected Move:	11290	3	13	14	24900


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  1  0  0  0  0  0  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 59 #######################


> Neighbours evaluated; 21
> Selected Move:	11290	4	19	3	23800


> New Y[]: 
	
	 0  0  0  3  0  0  2  0  1  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 60 #######################


> Neighbours evaluated; 23
> Selected Move:	11290	4	3	6	24400


> New Y[]: 
	
	 0  0  0  2  0  0  3  0  1  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 61 #######################


> Neighbours evaluated; 19
> Selected Move:	11290	4	3	8	23100


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  2  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 62 #######################


> Neighbours evaluated; 26
> Selected Move:	11290	4	6	3	24800


> New Y[]: 
	
	 0  0  0  3  0  0  1  0  2  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 63 #######################


> Neighbours evaluated; 19
> Selected Move:	11290	4	3	14	25000


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  2  0  0  0  0  0  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 64 #######################


> Neighbours evaluated; 20
> Selected Move:	11290	4	8	6	24000


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  1  0  0  0  0  0  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 65 #######################


> Neighbours evaluated; 23
> Selected Move:	11290	4	6	14	24600


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  1  0  0  0  0  0  2  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 66 #######################


> Neighbours evaluated; 19
> Selected Move:	11290	4	14	18	23600


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  1  0  0  0  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 67 #######################


> Neighbours evaluated; 24
> Selected Move:	11290	4	6	8	24700


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  3  0  0  0  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 68 #######################


> Neighbours evaluated; 22
> Selected Move:	11290	4	8	18	24500


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  2  0  0  0  0  0  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 69 #######################


> Neighbours evaluated; 16
> Selected Move:	11290	4	8	6	23500


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  1  0  0  0  0  0  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 70 #######################


> Neighbours evaluated; 21
> Selected Move:	11290	4	18	8	23200


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  3  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 71 #######################


> Neighbours evaluated; 24
> Selected Move:	11270	3	14	13	22700


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  3  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 72 #######################


> Neighbours evaluated; 25
> Selected Move:	11270	4	6	3	25000


> New Y[]: 
	
	 0  0  0  2  0  0  1  0  3  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 73 #######################


> Neighbours evaluated; 20
> Selected Move:	11270	4	3	8	24300


> New Y[]: 
	
	 0  0  0  3  0  0  1  0  2  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 74 #######################


> Neighbours evaluated; 19
> Selected Move:	11270	4	3	6	22600


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  2  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 75 #######################


> Neighbours evaluated; 23
> Selected Move:	11270	4	6	13	25000


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  2  0  0  0  0  3  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 76 #######################


> Neighbours evaluated; 20
> Selected Move:	11270	4	8	6	24000


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  1  0  0  0  0  3  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 77 #######################


> Neighbours evaluated; 22
> Selected Move:	11270	4	6	13	24300


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  1  0  0  0  0  2  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 78 #######################


> Neighbours evaluated; 20
> Selected Move:	11270	4	13	3	23900


> New Y[]: 
	
	 0  0  0  2  0  0  3  0  1  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 79 #######################


> Neighbours evaluated; 19
> Selected Move:	11270	4	3	6	23300


> New Y[]: 
	
	 0  0  0  3  0  0  2  0  1  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 80 #######################


> Neighbours evaluated; 18
> Selected Move:	11270	4	3	18	23000


> New Y[]: 
	
	 0  0  0  1  0  0  2  0  1  0  0  0  0  1  0  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 81 #######################


> Neighbours evaluated; 22
> Selected Move:	11270	4	6	8	24000


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  2  0  0  0  0  1  0  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 82 #######################


> Neighbours evaluated; 20
> Selected Move:	11270	4	8	18	24200


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  3  0  0  0  0  1  0  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 83 #######################


> Neighbours evaluated; 20
> Selected Move:	11270	4	8	3	24800


> New Y[]: 
	
	 0  0  0  3  0  0  1  0  1  0  0  0  0  1  0  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 84 #######################


> Neighbours evaluated; 20
> Selected Move:	11270	4	3	6	23100


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  1  0  0  0  0  1  0  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 85 #######################


> Neighbours evaluated; 23
> Selected Move:	11168	4	6	13	25500


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  1  0  0  0  0  3  0  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 86 #######################


> Neighbours evaluated; 23
> Selected Move:	11190	3	13	14	25500


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  1  0  0  0  0  0  3  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 87 #######################


> Neighbours evaluated; 23
> Selected Move:	11232	4	14	3	25300


> New Y[]: 
	
	 0  0  0  3  0  0  1  0  1  0  0  0  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 88 #######################


> Neighbours evaluated; 25
> Selected Move:	11138	4	3	18	25800


> New Y[]: 
	
	 0  0  0  2  0  0  1  0  1  0  0  0  0  0  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 89 #######################


> Neighbours evaluated; 23
> Selected Move:	11305	3	14	15	25300


> New Y[]: 
	
	 0  0  0  2  0  0  1  0  1  0  0  0  0  0  0  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 90 #######################


> Neighbours evaluated; 21
> Selected Move:	11341	4	3	15	25100


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  2  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 91 #######################


> Neighbours evaluated; 30
> Selected Move:	11134	3	15	13	25700


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  1  0  0  0  0  2  0  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 92 #######################


> Neighbours evaluated; 16
> Selected Move:	11210	4	13	3	25300


> New Y[]: 
	
	 0  0  0  2  0  0  1  0  1  0  0  0  0  1  0  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 93 #######################


> Neighbours evaluated; 21
> Selected Move:	11060	3	3	4	25000


> New Y[]: 
	
	 0  0  0  0  2  0  1  0  1  0  0  0  0  1  0  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 94 #######################


> Neighbours evaluated; 34
> Selected Move:	11080	3	13	15	25000


> New Y[]: 
	
	 0  0  0  0  2  0  1  0  1  0  0  0  0  0  0  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 95 #######################


> Neighbours evaluated; 45
> Selected Move:	11080	4	4	6	23500


> New Y[]: 
	
	 0  0  0  0  1  0  2  0  1  0  0  0  0  0  0  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 96 #######################


> Neighbours evaluated; 52
> Selected Move:	11180	3	19	5	25000


> New Y[]: 
	
	 0  0  0  0  1  1  2  0  1  0  0  0  0  0  0  1  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 97 #######################


> Neighbours evaluated; 29
> Selected Move:	11180	4	18	4	24500


> New Y[]: 
	
	 0  0  0  0  3  1  2  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 98 #######################


> Neighbours evaluated; 32
> Selected Move:	11180	4	4	5	24600


> New Y[]: 
	
	 0  0  0  0  1  3  2  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 99 #######################


> Neighbours evaluated; 30
> Selected Move:	11180	4	5	6	24700


> New Y[]: 
	
	 0  0  0  0  1  2  3  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 100 #######################


> Neighbours evaluated; 32
> Selected Move:	11180	4	5	8	24600


> New Y[]: 
	
	 0  0  0  0  1  1  3  0  2  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 101 #######################


> Neighbours evaluated; 35
> Selected Move:	11180	4	6	8	24700


> New Y[]: 
	
	 0  0  0  0  1  1  2  0  3  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 102 #######################


> Neighbours evaluated; 30
> Selected Move:	11180	3	4	3	24200


> New Y[]: 
	
	 0  0  0  1  0  1  2  0  3  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 103 #######################


> Neighbours evaluated; 31
> Selected Move:	11180	4	6	8	24100


> New Y[]: 
	
	 0  0  0  1  0  1  3  0  2  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 104 #######################


> Neighbours evaluated; 31
> Selected Move:	11180	4	8	5	24200


> New Y[]: 
	
	 0  0  0  1  0  2  3  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 105 #######################


> Neighbours evaluated; 32
> Selected Move:	11180	4	5	6	24100


> New Y[]: 
	
	 0  0  0  1  0  3  2  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 106 #######################


> Neighbours evaluated; 31
> Selected Move:	11180	4	5	3	24800


> New Y[]: 
	
	 0  0  0  3  0  1  2  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 107 #######################


> Neighbours evaluated; 28
> Selected Move:	11180	4	3	15	24900


> New Y[]: 
	
	 0  0  0  1  0  1  2  0  1  0  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 108 #######################


> Neighbours evaluated; 27
> Selected Move:	11180	4	15	18	24500


> New Y[]: 
	
	 0  0  0  1  0  1  2  0  1  0  0  0  0  0  0  1  0  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 109 #######################


> Neighbours evaluated; 30
> Selected Move:	11180	4	6	18	24600


> New Y[]: 
	
	 0  0  0  1  0  1  3  0  1  0  0  0  0  0  0  1  0  0  2  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 110 #######################


> Neighbours evaluated; 33
> Selected Move:	11163	3	3	4	25100


> New Y[]: 
	
	 0  0  0  0  1  1  3  0  1  0  0  0  0  0  0  1  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 111 #######################


> Neighbours evaluated; 32
> Selected Move:	11164	4	18	4	25100


> New Y[]: 
	
	 0  0  0  0  2  1  3  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 112 #######################


> Neighbours evaluated; 35
> Selected Move:	11116	3	4	3	25400


> New Y[]: 
	
	 0  0  0  2  0  1  3  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 113 #######################


> Neighbours evaluated; 29
> Selected Move:	11149	4	3	15	25200


> New Y[]: 
	
	 0  0  0  1  0  1  3  0  1  0  0  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 114 #######################


> Neighbours evaluated; 33
> Selected Move:	11075	3	3	4	25700


> New Y[]: 
	
	 0  0  0  0  1  1  3  0  1  0  0  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 115 #######################


> Neighbours evaluated; 31
> Selected Move:	11118	4	6	15	25400


> New Y[]: 
	
	 0  0  0  0  1  1  2  0  1  0  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 116 #######################


> Neighbours evaluated; 34
> Selected Move:	11080	3	5	19	23900


> New Y[]: 
	
	 0  0  0  0  1  0  2  0  1  0  0  0  0  0  0  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 117 #######################


> Neighbours evaluated; 57
> Selected Move:	11124	1	-1	10	29400


> New Y[]: 
	
	 0  0  0  0  1  0  2  0  1  0  1  0  0  0  0  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 118 #######################


> Neighbours evaluated; 48
> Selected Move:	11255	4	15	4	28500


> New Y[]: 
	
	 0  0  0  0  3  0  2  0  1  0  1  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 119 #######################


> Neighbours evaluated; 59
> Selected Move:	11218	3	15	13	28500


> New Y[]: 
	
	 0  0  0  0  3  0  2  0  1  0  1  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,18

## ITERATION 120 #######################


> Neighbours evaluated; 44
> Selected Move:	11164	4	4	8	28700


> New Y[]: 
	
	 0  0  0  0  1  0  2  0  3  0  1  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,185

## ITERATION 121 #######################


> Neighbours evaluated; 43
> Selected Move:	11166	3	13	15	28700


> New Y[]: 
	
	 0  0  0  0  1  0  2  0  3  0  1  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 122 #######################


> Neighbours evaluated; 54
> Selected Move:	11166	4	6	8	28600


> New Y[]: 
	
	 0  0  0  0  1  0  3  0  2  0  1  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 123 #######################


> Neighbours evaluated; 56
> Selected Move:	11128	3	15	13	28600


> New Y[]: 
	
	 0  0  0  0  1  0  3  0  2  0  1  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,2

## ITERATION 124 #######################


> Neighbours evaluated; 44
> Selected Move:	11060	3	4	3	28100


> New Y[]: 
	
	 0  0  0  1  0  0  3  0  2  0  1  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 125 #######################


> Neighbours evaluated; 26
> Selected Move:	11137	3	10	2	27600


> New Y[]: 
	
	 0  0  1  1  0  0  3  0  2  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 126 #######################


> Neighbours evaluated; 39
> Selected Move:	11224	3	13	15	27600


> New Y[]: 
	
	 0  0  1  1  0  0  3  0  2  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 127 #######################


> Neighbours evaluated; 44
> Selected Move:	11234	3	19	12	28100


> New Y[]: 
	
	 0  0  1  1  0  0  3  0  2  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 128 #######################


> Neighbours evaluated; 31
> Selected Move:	11196	4	6	8	28200


> New Y[]: 
	
	 0  0  1  1  0  0  2  0  3  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 129 #######################


> Neighbours evaluated; 30
> Selected Move:	11325	3	8	1	26000


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 130 #######################


> Neighbours evaluated; 38
> Selected Move:	11305	3	12	19	25500


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 131 #######################


> Neighbours evaluated; 82
> Selected Move:	11203	3	15	13	25500


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 132 #######################


> Neighbours evaluated; 68
> Selected Move:	11180	3	13	14	26000


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 133 #######################


> Neighbours evaluated; 70
> Selected Move:	11183	3	19	12	26500


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 134 #######################


> Neighbours evaluated; 24
> Selected Move:	11135	3	6	17	26900


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  0  0  0  0  1  0  1  0  0  2  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 135 #######################


> Neighbours evaluated; 28
> Selected Move:	11253	3	14	15	26400


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  0  0  0  0  1  0  0  1  0  2  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 136 #######################


> Neighbours evaluated; 39
> Selected Move:	11146	3	15	13	26400


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  0  0  0  0  1  1  0  0  0  2  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 137 #######################


> Neighbours evaluated; 26
> Selected Move:	11065	3	17	6	26000


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,27

## ITERATION 138 #######################


> Neighbours evaluated; 27
> Selected Move:	10850	3	12	9	26000


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  1  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 139 #######################


> Neighbours evaluated; 35
> Selected Move:	10845	3	13	15	26000


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 140 #######################


> Neighbours evaluated; 47
> Selected Move:	10840	3	3	7	26000


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 141 #######################


> Neighbours evaluated; 38
> Selected Move:	10945	3	9	12	26000


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 142 #######################


> Neighbours evaluated; 28
> Selected Move:	11115	3	7	4	26500


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 143 #######################


> Neighbours evaluated; 33
> Selected Move:	11050	3	6	17	26900


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 144 #######################


> Neighbours evaluated; 32
> Selected Move:	11060	3	4	7	26400


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 145 #######################


> Neighbours evaluated; 32
> Selected Move:	10870	4	17	18	27000


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 146 #######################


> Neighbours evaluated; 26
> Selected Move:	10990	3	7	3	27000


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  0  0  0  0  1  0  0  1  0  1  2  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 147 #######################


> Neighbours evaluated; 39
> Selected Move:	10880	3	15	13	27000


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  0  0  0  0  1  1  0  0  0  1  2  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 148 #######################


> Neighbours evaluated; 25
> Selected Move:	10810	3	13	14	27500


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  0  0  0  0  1  0  1  0  0  1  2  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 149 #######################


> Neighbours evaluated; 27
> Selected Move:	10635	3	3	4	28000


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  0  1  0  1  0  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 150 #######################


> Neighbours evaluated; 17
> Selected Move:	10818	4	18	17	27400


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  0  1  0  1  0  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 151 #######################


> Neighbours evaluated; 23
> Selected Move:	10824	3	14	13	26900


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  0  1  1  0  0  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 152 #######################


> Neighbours evaluated; 20
> Selected Move:	10610	4	17	4	27500


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 153 #######################


> Neighbours evaluated; 20
> Selected Move:	10748	3	13	15	27500


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  0  0  0  0  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 154 #######################


> Neighbours evaluated; 31
> Selected Move:	10735	4	4	18	27500


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 155 #######################


> Neighbours evaluated; 36
> Selected Move:	10853	3	18	0	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,36

## ITERATION 156 #######################


> Neighbours evaluated; 53
> Selected Move:	10850	3	15	13	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,365

## ITERATION 157 #######################


> Neighbours evaluated; 48
> Selected Move:	10665	3	13	14	26000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,37

## ITERATION 158 #######################


> Neighbours evaluated; 55
> Selected Move:	10625	3	17	11	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 159 #######################


> Neighbours evaluated; 84
> Selected Move:	10610	3	4	7	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 160 #######################


> Neighbours evaluated; 84
> Selected Move:	10650	3	14	13	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 161 #######################


> Neighbours evaluated; 84
> Selected Move:	10650	3	11	17	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,39

## ITERATION 162 #######################


> Neighbours evaluated; 38
> Selected Move:	10650	3	13	15	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,395

## ITERATION 163 #######################


> Neighbours evaluated; 38
> Selected Move:	10650	3	17	11	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 164 #######################


> Neighbours evaluated; 85
> Selected Move:	10610	3	15	3	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 165 #######################


> Neighbours evaluated; 78
> Selected Move:	10655	3	7	17	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 166 #######################


> Neighbours evaluated; 76
> Selected Move:	10670	2	11	-1	20500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 167 #######################


> Neighbours evaluated; 53
> Selected Move:	10635	1	-1	8	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 168 #######################


> Neighbours evaluated; 45
> Selected Move:	10580	4	1	2	22600


> New Y[]: 
	
	 2  0  3  1  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 169 #######################


> Neighbours evaluated; 53
> Selected Move:	10663	1	-1	15	27100


> New Y[]: 
	
	 2  0  3  1  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 170 #######################


> Neighbours evaluated; 24
> Selected Move:	11080	4	2	17	26000


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  0  0  1  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 171 #######################


> Neighbours evaluated; 38
> Selected Move:	10995	3	15	13	26000


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  0  0  1  1  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 172 #######################


> Neighbours evaluated; 37
> Selected Move:	11120	3	2	19	25000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  0  1  1  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 173 #######################


> Neighbours evaluated; 67
> Selected Move:	10980	3	13	15	25000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  0  1  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 174 #######################


> Neighbours evaluated; 70
> Selected Move:	10860	3	12	2	25500


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 175 #######################


> Neighbours evaluated; 43
> Selected Move:	10858	3	15	13	25500


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  0  0  0  1  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 176 #######################


> Neighbours evaluated; 38
> Selected Move:	10790	3	2	9	25000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 177 #######################


> Neighbours evaluated; 64
> Selected Move:	10780	3	13	15	25000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  1  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 178 #######################


> Neighbours evaluated; 71
> Selected Move:	10660	3	15	2	25500


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  1  0  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 179 #######################


> Neighbours evaluated; 79
> Selected Move:	10645	3	9	14	26000


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  0  0  0  0  1  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 180 #######################


> Neighbours evaluated; 38
> Selected Move:	10745	3	19	12	26500


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  1  0  0  0  1  0  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 181 #######################


> Neighbours evaluated; 39
> Selected Move:	10703	3	2	19	25500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 182 #######################


> Neighbours evaluated; 74
> Selected Move:	10500	3	12	9	25500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  1  0  0  0  0  1  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 183 #######################


> Neighbours evaluated; 71
> Selected Move:	10480	2	9	-1	21000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 184 #######################


> Neighbours evaluated; 28
> Selected Move:	10750	3	0	18	23000


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  3  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 185 #######################


> Neighbours evaluated; 23
> Selected Move:	10860	3	14	15	22500


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  3  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 186 #######################


> Neighbours evaluated; 28
> Selected Move:	10860	4	17	3	24300


> New Y[]: 
	
	 0  0  0  3  0  0  0  0  1  0  0  0  0  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 187 #######################


> Neighbours evaluated; 23
> Selected Move:	10860	4	3	8	23700


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,45

## ITERATION 188 #######################


> Neighbours evaluated; 25
> Selected Move:	10860	4	8	15	24400


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  3  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 189 #######################


> Neighbours evaluated; 22
> Selected Move:	10860	4	15	18	24600


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  2  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 190 #######################


> Neighbours evaluated; 22
> Selected Move:	10860	4	15	3	24800


> New Y[]: 
	
	 0  0  0  2  0  0  0  0  1  0  0  0  0  0  0  1  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 191 #######################


> Neighbours evaluated; 23
> Selected Move:	10860	4	3	8	23500


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  2  0  0  0  0  0  0  1  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 192 #######################


> Neighbours evaluated; 27
> Selected Move:	10860	4	8	17	23400


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 193 #######################


> Neighbours evaluated; 28
> Selected Move:	10860	4	18	3	23700


> New Y[]: 
	
	 0  0  0  3  0  0  0  0  1  0  0  0  0  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 194 #######################


> Neighbours evaluated; 27
> Selected Move:	10860	4	3	8	23100


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 195 #######################


> Neighbours evaluated; 27
> Selected Move:	10860	4	8	15	23800


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  3  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,41

## ITERATION 196 #######################


> Neighbours evaluated; 27
> Selected Move:	10860	4	15	17	23100


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  2  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,405

## ITERATION 197 #######################


> Neighbours evaluated; 27
> Selected Move:	10860	4	15	3	23300


> New Y[]: 
	
	 0  0  0  2  0  0  0  0  1  0  0  0  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 198 #######################


> Neighbours evaluated; 27
> Selected Move:	10860	4	3	8	22000


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  2  0  0  0  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,395

## ITERATION 199 #######################


> Neighbours evaluated; 30
> Selected Move:	10860	4	8	19	24300


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  3  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,39

## ITERATION 200 #######################


> Neighbours evaluated; 27
> Selected Move:	10860	4	17	19	24800


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  2  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,385

## ITERATION 201 #######################


> Neighbours evaluated; 25
> Selected Move:	10860	4	17	8	24900


> New Y[]: 
	
	 0  0  0  1  0  0  0  0  2  0  0  0  0  0  0  1  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,38

## ITERATION 202 #######################


> Neighbours evaluated; 23
> Selected Move:	11208	3	17	6	25400


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  2  0  0  0  0  0  0  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 203 #######################


> Neighbours evaluated; 27
> Selected Move:	11143	3	19	5	25100


> New Y[]: 
	
	 0  0  0  1  0  3  1  0  2  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 204 #######################


> Neighbours evaluated; 28
> Selected Move:	11069	4	5	8	25300


> New Y[]: 
	
	 0  0  0  1  0  2  1  0  3  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 205 #######################


> Neighbours evaluated; 29
> Selected Move:	10995	3	5	19	26000


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  3  0  0  0  0  0  0  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 206 #######################


> Neighbours evaluated; 25
> Selected Move:	10910	3	15	13	26000


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  3  0  0  0  0  1  0  0  0  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 207 #######################


> Neighbours evaluated; 15
> Selected Move:	11124	4	8	19	25400


> New Y[]: 
	
	 0  0  0  1  0  0  1  0  2  0  0  0  0  1  0  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 208 #######################


> Neighbours evaluated; 18
> Selected Move:	11043	3	19	5	25100


> New Y[]: 
	
	 0  0  0  1  0  3  1  0  2  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 209 #######################


> Neighbours evaluated; 14
> Selected Move:	11080	4	5	6	24100


> New Y[]: 
	
	 0  0  0  1  0  1  3  0  2  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 210 #######################


> Neighbours evaluated; 18
> Selected Move:	11180	3	13	14	24600


> New Y[]: 
	
	 0  0  0  1  0  1  3  0  2  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 211 #######################


> Neighbours evaluated; 20
> Selected Move:	11180	4	6	8	24700


> New Y[]: 
	
	 0  0  0  1  0  1  2  0  3  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 212 #######################


> Neighbours evaluated; 21
> Selected Move:	11180	4	8	5	24600


> New Y[]: 
	
	 0  0  0  1  0  3  2  0  1  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 213 #######################


> Neighbours evaluated; 20
> Selected Move:	11180	4	5	6	24700


> New Y[]: 
	
	 0  0  0  1  0  2  3  0  1  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 214 #######################


> Neighbours evaluated; 21
> Selected Move:	11140	4	5	18	25100


> New Y[]: 
	
	 0  0  0  1  0  1  3  0  1  0  0  0  0  0  1  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 215 #######################


> Neighbours evaluated; 17
> Selected Move:	11180	4	6	18	25000


> New Y[]: 
	
	 0  0  0  1  0  1  2  0  1  0  0  0  0  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 216 #######################


> Neighbours evaluated; 20
> Selected Move:	11080	3	14	13	24500


> New Y[]: 
	
	 0  0  0  1  0  1  2  0  1  0  0  0  0  1  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 217 #######################


> Neighbours evaluated; 18
> Selected Move:	11080	4	6	18	24600


> New Y[]: 
	
	 0  0  0  1  0  1  3  0  1  0  0  0  0  1  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 218 #######################


> Neighbours evaluated; 17
> Selected Move:	11080	4	18	5	24200


> New Y[]: 
	
	 0  0  0  1  0  2  3  0  1  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 219 #######################


> Neighbours evaluated; 14
> Selected Move:	11080	4	5	6	24100


> New Y[]: 
	
	 0  0  0  1  0  3  2  0  1  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 220 #######################


> Neighbours evaluated; 13
> Selected Move:	11080	4	5	3	24800


> New Y[]: 
	
	 0  0  0  3  0  1  2  0  1  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 221 #######################


> Neighbours evaluated; 10
> Selected Move:	11080	4	3	8	24200


> New Y[]: 
	
	 0  0  0  1  0  1  2  0  3  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 222 #######################


> Neighbours evaluated; 16
> Selected Move:	10990	3	3	4	24700


> New Y[]: 
	
	 0  0  0  0  1  1  2  0  3  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 223 #######################


> Neighbours evaluated; 11
> Selected Move:	11107	3	13	14	25200


> New Y[]: 
	
	 0  0  0  0  1  1  2  0  3  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 224 #######################


> Neighbours evaluated; 13
> Selected Move:	11180	4	8	4	25000


> New Y[]: 
	
	 0  0  0  0  3  1  2  0  1  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 225 #######################


> Neighbours evaluated; 12
> Selected Move:	11145	4	4	5	25100


> New Y[]: 
	
	 0  0  0  0  1  3  2  0  1  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 226 #######################


> Neighbours evaluated; 11
> Selected Move:	11110	4	5	6	25200


> New Y[]: 
	
	 0  0  0  0  1  2  3  0  1  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 227 #######################


> Neighbours evaluated; 12
> Selected Move:	11146	4	5	8	25100


> New Y[]: 
	
	 0  0  0  0  1  1  3  0  2  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 228 #######################


> Neighbours evaluated; 21
> Selected Move:	11010	3	5	19	23600


> New Y[]: 
	
	 0  0  0  0  1  0  3  0  2  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 229 #######################


> Neighbours evaluated; 44
> Selected Move:	11080	3	14	15	23100


> New Y[]: 
	
	 0  0  0  0  1  0  3  0  2  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 230 #######################


> Neighbours evaluated; 51
> Selected Move:	11080	4	6	4	24000


> New Y[]: 
	
	 0  0  0  0  3  0  1  0  2  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 231 #######################


> Neighbours evaluated; 51
> Selected Move:	11080	4	4	8	24700


> New Y[]: 
	
	 0  0  0  0  2  0  1  0  3  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 232 #######################


> Neighbours evaluated; 40
> Selected Move:	11080	4	4	6	23200


> New Y[]: 
	
	 0  0  0  0  1  0  2  0  3  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 233 #######################


> Neighbours evaluated; 48
> Selected Move:	11080	4	6	18	24700


> New Y[]: 
	
	 0  0  0  0  1  0  1  0  3  0  0  0  0  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 234 #######################


> Neighbours evaluated; 43
> Selected Move:	11080	4	8	4	24500


> New Y[]: 
	
	 0  0  0  0  3  0  1  0  1  0  0  0  0  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 235 #######################


> Neighbours evaluated; 45
> Selected Move:	11080	4	4	6	23600


> New Y[]: 
	
	 0  0  0  0  1  0  3  0  1  0  0  0  0  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 236 #######################


> Neighbours evaluated; 48
> Selected Move:	11080	4	18	4	23600


> New Y[]: 
	
	 0  0  0  0  2  0  3  0  1  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 237 #######################


> Neighbours evaluated; 49
> Selected Move:	11080	4	4	6	23000


> New Y[]: 
	
	 0  0  0  0  3  0  2  0  1  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 238 #######################


> Neighbours evaluated; 46
> Selected Move:	11080	4	4	19	24900


> New Y[]: 
	
	 0  0  0  0  1  0  2  0  1  0  0  0  0  0  0  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285
________________________________________________________________

Best solution found: 11360
Run Termination time: 03.02.2010 21:47:07
Run duration: 00:01:48.9375000
________________________________________________________________
